Homomorphic Encryption: From Private-Key to Public-Key

نویسنده

  • Ron Rothblum
چکیده

We show how to transform any additively homomorphic privatekey encryption scheme that is compact, into a public-key encryption scheme. By compact we mean that the length of a homomorphically generated encryption is independent of the number of ciphertexts from which it was created. We do not require anything else on the distribution of homomorphically generated encryptions (in particular, we do not require them to be distributed like real ciphertexts). Our resulting public-key scheme is homomorphic in the following sense. If the private-key scheme is i+1-hop homomorphic with respect to some set of operations then the public-key scheme we construct is i-hop homomorphic with respect to the same set of operations.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes

We present a fully homomorphic encryption scheme which has both relatively small key and ciphertext size. Our construction follows that of Gentry by producing a fully homomorphic scheme from a “somewhat” homomorphic scheme. For the somewhat homomorphic scheme the public and private keys consist of two large integers (one of which is shared by both the public and private key) and the ciphertext ...

متن کامل

Public-Key Locally-Decodable Codes

In this paper we introduce the notion of a Public-Key Encryption Scheme that is also a Locally-Decodable Error-Correcting Code (PKLDC). In particular, we allow any polynomialtime adversary to read the entire ciphertext, and corrupt a constant fraction of the bits of the entire ciphertext. Nevertheless, the decoding algorithm can recover any bit of the plaintext with all but negligible probabili...

متن کامل

Fully Homomorphic Encryption

In these notes we describe how to use our family of random lattices Λq(A) to build a fully homomorphic encryption scheme, i.e., an encryption scheme that allows to perform arbitrary computations on encrypted messages, without knowing the secret decryption key. For simplicity, we consider private encryption schemes, where the encryption and decryption algorithms use the same secret key. This is ...

متن کامل

Symmetric Somewhat Homomorphic Encryption over the Integers

We describe a symmetric variant of homomomorphic encryption scheme by van Dijk et al. [DGHV10], semantically secure under the error-free approximate-GCD problem. We also provide the implementation of the scheme as a C/C++ library. The scheme allows to perform “mixed” homomorphic operations on ciphertexts and plaintexts, eliminating the need to encrypt new ciphertexts using the public key for so...

متن کامل

A key recovery attack to the scale-invariant NTRU-based somewhat homomorphic encryption scheme

In this paper we present a key recovery attack to the scale-invariant NTRU-based somewhat homomorphic encryption scheme proposed by Bos et al [BLLN13] in 2013. The attack allows us to compute the private key for t > 2 and when the private key is chosen with coefficients in {−1, 0, 1}. The efficiency of the attack is optimal since it requires just one decryption oracle query, showing that if we ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electronic Colloquium on Computational Complexity (ECCC)

دوره 17  شماره 

صفحات  -

تاریخ انتشار 2010